Constrained state assignment of easily testable FSMs

نویسندگان

  • Maria J. Avedillo
  • José M. Quintana
  • José Luis Huertas
چکیده

We investigate the relationship between the state assignment of the sequential machine and the observability of a faulty internal state on the primary outputs for faults that result in unidirectional errors. We state sufficient conditions for faulty states to propagate to primary outputs in one clock cycle and use them to derive the constraints that must be imposed on the state assignment of the machine to guarantee the existence of unit-length distinguishing sequences valid in fault conditions for each true-faulty state pair.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Easily Testable PLA-based FSMS

-A new hardware scheme for easily testable PLA-based Finite State Machines is proposed. With our scheme, all combinationally irredundant crosspoint faults in the PLA logic implementation are testable. Moreover, test generation is easily accomplished because short systematic initialization sequences exist for each internal state in the machine and unit length distinguishing sequences, which hold...

متن کامل

A unified approach to the synthesis of fully testable sequential machines

• In this paper we attempt to unify and extend the various approaches to synthesizing fully S testable sequential circuits that can be modeled as finite state machines (FSMs). We first identify classes of redundancies and isolate equivalent-state redundancies as those most difficult to eliminate. We then show that the essential problem behind equivalent-state redundancies is the creation of val...

متن کامل

Exact Dichotomy-based Constrained Encoding

Constrained encoding has several applications in the synthesis of finite state machines (FSMs). E.g., it can be used to generate asynchronous FSM state assignment that guarantees a critical hazard-free implementation, or to generate synchronous FSM state assignment with minimum PLA implementation. This paper presents ZEDICHO, an original zero-suppressed binary decision diagram (ZBDD) based algo...

متن کامل

Fsmtest: Synthesis for Testability and Test Generation of Pla-based Fsms

A new hardware scheme for easily testable PLA-based Finite State Machines is proposed. With our scheme, all combinationally irredundant crosspoint faults in the PLA logic implementation are testable. Moreover, test generation is easily accomplished because short systematic initialization sequences exist for each internal state in the machine and unit length distinguishing sequences, which hold ...

متن کامل

Easily testable PLA-based finite state machines

the area and timing penalty associated with LSSD techniques are not acceptable to designers. In this paper, we outline a synthesis procedure, which Logic synthesis and minimization techniques can, in beginning from a State Transition Graph description principle, ensure fully and easily testable combinational of a sequential machine, produces an optimized easily and sequential circuit designs. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Electronic Testing

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1995